canonical algorithm

См. также в других словарях:

• Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

• Canonical Huffman code — A canonical Huffman code is a particular type of Huffman code which has the property that it can be very compactly described.Data compressors generally work in one of two ways. Either the decompressor can infer what codebook the compressor has… …   Wikipedia

• Canonical order — In computing, a canonical order is the order of elements that obeys a certain set of rules or specifications. Sorting algorithms are often used to canonicalize data sets.ee also* Canonicalization …   Wikipedia

• Knuth-Bendix completion algorithm — The Knuth Bendix completion algorithm is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system. When the algorithm succeeds, it has effectively solved the word problem for the specified algebra. An… …   Wikipedia

• Package-merge algorithm — The Package Merge Algorithm is an O(nL) time algorithm for finding anoptimal length limited Huffman code for a given distribution on a given alphabet of size n , where no code word is longer than L . It is a greedy algorithm, and a generalization …   Wikipedia

• Root-finding algorithm — A root finding algorithm is a numerical method, or algorithm, for finding a value x such that f(x) = 0, for a given function f. Such an x is called a root of the function f. This article is concerned with finding scalar, real or complex roots,… …   Wikipedia

• Boyer–Moore–Horspool algorithm — In computer science, the Boyer–Moore–Horspool algorithm or Horspool s algorithm is an algorithm for finding substrings in strings. It is a simplification of the Boyer Moore algorithm which is related to the Knuth Morris Pratt algorithm. The… …   Wikipedia

• Linear canonical transformation — Paraxial optical systems implemented entirely with thin lenses and propagation through free space and/or graded index (GRIN) media, are Quadratic Phase Systems (QPS). The effect of any arbitrary QPS on an input wavefield can be described using… …   Wikipedia

• Quine–McCluskey algorithm — The Quine–McCluskey algorithm (or the method of prime implicants) is a method used for minimization of boolean functions which was developed by W.V. Quine and Edward J. McCluskey. It is functionally identical to Karnaugh mapping, but the tabular… …   Wikipedia

• Buchberger's algorithm — In computational algebraic geometry and computational commutative algebra, Buchberger s algorithm is a method of transforming a given set of generators for a polynomial ideal into a Gröbner basis with respect to some monomial order. It was… …   Wikipedia

• Gibbs algorithm — In statistical mechanics, the Gibbs algorithm, first introduced by J. Willard Gibbs in 1878, is the injunction to choose a statistical ensemble (probability distribution) for the unknown microscopic state of a thermodynamic system by minimising… …   Wikipedia